A general formula for the method of steepest descent using Perron’s formula

نویسنده

  • James Mathews
چکیده

where f and g are (usually) analytic functions, k is (usually) a real parameter. The general idea is to use Cauchy’s theorem which allows deformation of contours in the complex plane to simplify the problem. The idea was proposed by Debye, and the basic idea is to choose a new contour D such that • D passes through one of more zeros of f ′(z) • The imaginary part of f(z) is constant on D Since the imaginary part of the integral is constant, then if f(z) = g(z) + ih then we instead need to evaluate. I(k)e ∫

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems

In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value...

متن کامل

Hybrid steepest-descent method with sequential and functional errors in Banach space

Let $X$ be a reflexive Banach space, $T:Xto X$ be a nonexpansive mapping with $C=Fix(T)neqemptyset$ and $F:Xto X$ be $delta$-strongly accretive and $lambda$- strictly pseudocotractive with $delta+lambda>1$. In this paper, we present modified hybrid steepest-descent methods, involving sequential errors and functional errors with functions admitting a center, which generate convergent sequences ...

متن کامل

An Asymptotic Formula for the Coefficients of J(z) Mathematics Subject Classification 2010: 11f30

Published 15 We obtain a new proof of an asymptotic formula for the coefficients of the j-invariant 16 of elliptic curves. Our proof does not use the circle method. We use Laplace's method 17 of steepest descent and the Hardy–Ramanujan asymptotic formula for the partition 18 function. (The latter asymptotic formula can be derived without the circle method.)

متن کامل

A new Levenberg-Marquardt approach based on Conjugate gradient structure for solving absolute value equations

In this paper, we present a new approach for solving absolute value equation (AVE) whichuse Levenberg-Marquardt method with conjugate subgradient structure. In conjugate subgradientmethods the new direction obtain by combining steepest descent direction and the previous di-rection which may not lead to good numerical results. Therefore, we replace the steepest descentdir...

متن کامل

Fe b 20 09 Uniform Asymptotics of the Meixner Polynomials

Using the steepest descent method of Deift-Zhou, we derive locally uniform asymptotic formulas for the Meixner polynomials. These include an asymptotic formula in a neighborhood of the origin, a result which as far as we are aware has not yet been obtained previously. This particular formula involves a Cauchy integral, which is the uniformly bounded solution to a scalar Riemann-Hilbert problem,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013